FIB Aplasia through probabilistic routing and autoforwarding

نویسندگان

  • Giuseppe Rossini
  • Dario Rossi
  • Christophe Betoule
  • Remi Clavier
  • Gilles Thouénon
چکیده

In this work, we propose APLASIA, an holistic architecture with a radical design. Aiming at simplifying the inner network devices (and so their cost), we tradeoff node architectureand algorithmic-complexity for an increased (but tunable) communication cost. The main ingredients of our recipe are (i) the use of complete paths directly in the frames header, that allows core devices to perform data-plane switching functions without lookup and (ii) the use of a greedy probabilistic routing algorithm to quickly discover multiple, near optimal, paths in the control plane. We extensively simulate, analyze and implement our proposal to testify its soundness.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficiency of a multi-objective imperialist competitive algorithm: A bi-objective location-routing-inventory problem with probabilistic routes

An integrated model considers all parameters and elements of different deficiencies in one problem. This paper presents a new integrated model of a supply chain that simultaneously considers facility location, vehicle routing and inventory control problems as well as their interactions in one problem, called location-routing-inventory (LRI) problem. This model also considers stochastic demands ...

متن کامل

Energy-Aware Probabilistic Epidemic Forwarding Method in Heterogeneous Delay Tolerant Networks

Due to the increasing use of wireless communications, infrastructure-less networks such as Delay Tolerant Networks (DTNs) should be highly considered. DTN is most suitable where there is an intermittent connection between communicating nodes such as wireless mobile ad hoc network nodes. In general, a message sending node in DTN copies the message and transmits it to nodes which it encounters. A...

متن کامل

Practical and Near-Optimal FIB Aggregation using SMALTA

IP Routers use sophisticated forwarding table (FIB) lookup algorithms that minimize lookup time, storage, and update time. This paper presents SMALTA, a practical, near-optimal FIB aggregation scheme that shrinks forwarding table size without modifying routing semantics or the external behavior of routers, and without requiring changes to FIB lookup algorithms and associated hardware and softwa...

متن کامل

Exploiting Locality of Churn for FIB Aggregation

Snapshots of the Forwarding Information Base (FIB) in Internet routers can be compressed (or aggregated) to at least half of their original size, as shown by previous studies. In practice however, the permanent stream of updates to the FIB due to routing updates complicates FIB aggregation: keeping an optimally aggregated FIB in face of these routing updates is algorithmically challenging. A se...

متن کامل

Stochastic Approach to Vehicle Routing Problem: Development and Theories

Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Networks

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2013